The AutoProof Verifier: Usability by Non-Experts and on Standard Code Carlo A. Furia Christopher M. Poskitt

Source URL: se.inf.ethz.ch

• Theoretical computer science
• Software engineering
• Formal methods
• Logic in computer science
• Software testing
• Formal verification
• Separation logic
• Loop invariant
• Software verification
• Eiffel
• Postcondition
• Invariant

Reviving Partial Order Planning XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZEmail: fxuanlong,

Source URL: rakaposhi.eas.asu.edu

• Automated planning and scheduling
• Operations research
• Partial-order planning
• Search algorithms
• Theoretical computer science
• Graphplan
• Mathematical optimization
• Algorithm
• Heuristic
• Planning

Caroline Haslett Computing Curriculum ­ Progression (Autumn 1)       

Source URL: swaygrantham.co.uk

• Theoretical computer science
• Computing
• Algorithm
• Mathematical logic
• Computer
• Academia
• Software
• Input/output
• Password
• Mathematics
• Quantum computing

On Finding Better Friends in Social Networks Philipp Brandes Roger Wattenhofer ETH Zurich – Distributed Computing – www.disco.ethz.ch

Source URL: www.tik.ee.ethz.ch

• Mathematics
• Theoretical computer science
• Distributed algorithms
• Applied mathematics
• Local algorithm
• Algorithm
• Computer programming
• Routing algorithms
• Search algorithms
• Property testing
• A* search algorithm

Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 Relaxed Two-Coloring of Cubic Graphs Robert Berke and Tibor Szab´o

Source URL: page.mi.fu-berlin.de

Intro RAND & DNC WWKL & RWWKL

Source URL: ludovicpatey.com

• Mathematics
• Computability theory
• Theoretical computer science
• Theory of computation
• Reverse mathematics
• Computable function
• Graph coloring
• Randomness
• Rand
• RAND Corporation

DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti

Source URL: ludovicpatey.com

• Mathematics
• Mathematical analysis
• Theory of computation
• Computability theory
• Theoretical computer science
• Computation in the limit
• Computable function
• Differential forms on a Riemann surface
• Congruence lattice problem

Lydia B. Chilton Research Statement I build hybrid human-computer systems that combine the strengths of human and machine intelligence to solve problems that neither one could solve independently. People have innate prob

Source URL: hmslydia.com

• Theoretical computer science
• Computer programming
• Software engineering
• Operations research
• Mathematics
• Crowdsourcing
• Algorithm
• Human-based computation
• Mathematical optimization
• Humancomputer interaction
• Problem solving
• Recursion

In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab

Source URL: robotics.stanford.edu

• Mathematics
• NP-complete problems
• Combinatorics
• Discrete mathematics
• Operations research
• Theoretical computer science
• Combinatorial optimization
• Greedy algorithm
• Matroid theory
• Robotics
• Robot
• Assignment problem

  Department of   Computer  Science & Engineering   

Source URL: www.cse.iitd.ernet.in

• Engineering
• Academia
• Science and technology
• Computer engineering
• Electrical engineering
• Theoretical computer science
• Computer science
• Outline of academic disciplines
• Computer vision
• Computing
• The Computer Journal
• PolicyPitch